Incremental Support Vector Machine Framework for Visual Sensor Networks
نویسندگان
چکیده
منابع مشابه
Incremental Support Vector Machine Framework for Visual Sensor Networks
Motivated by the emerging requirements of surveillance networks, we present in this paper an incremental multiclassification support vector machine (SVM) technique as a new framework for action classification based on real-time multivideo collected by homogeneous sites. The technique is based on an adaptation of least square SVM (LS-SVM) formulation but extends beyond the static image-based lea...
متن کاملIncremental Support Vector Machine Classification
Using a recently introduced proximal support vector machine classifier [4], a very fast and simple incremental support vector machine (SVM) classifier is proposed which is capable of modifying an existing linear classifier by both retiring old data and adding new data. A very important feature of the proposed single-pass algorithm , which allows it to handle massive datasets, is that huge block...
متن کاملIncremental Support Vector Machine Construction
SVMs suffer from the problem of large memory requirement and CPU time when trained in batch mode on large data sets. We overcome these limitations, and at the same time make SVMs suitable for learning with data streams, by constructing incremental learning algorithms. We first introduce and compare different incremental learning techniques, and show that they are capable of producing performanc...
متن کاملIncremental Nonlinear Proximal Support Vector Machine
Proximal SVM (PSVM), which is a variation of standard SVM, leads to an extremely faster and simpler algorithm for generating a linear or nonlinear classifier than classical SVM. An efficient incremental method for linear PSVM classifier has been introduced, but it can’t apply to nonlinear PSVM and incremental technique is the base of online learning and large data set training. In this paper we...
متن کاملIncremental and Decremental Support Vector Machine Learning
An on-line recursive algorithm for training support vector machines, one vector at a time, is presented. Adiabatic increments retain the KuhnTucker conditions on all previously seen training data, in a number of steps each computed analytically. The incremental procedure is reversible, and decremental “unlearning” offers an efficient method to exactly evaluate leave-one-out generalization perfo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2006
ISSN: 1687-6180
DOI: 10.1155/2007/64270